Concurrent transition systems
نویسندگان
چکیده
منابع مشابه
Concurrent Transition Systems
Concurrent transition systems (CTS's), are ordinary nondeterministic transition systems that have been equipped with additional concurrency information, speciied in terms of a binary residual operation on transitions. Each CTS C freely generates a complete CTS or computation category C , whose arrows are equivalence classes of nite computation sequences, modulo a congruence induced by the concu...
متن کاملUniversit at Augsburg Concurrent Implementation of Asynchronous Transition Systems Concurrent Implementation of Asynchronous Transition Systems
The synthesis problem is to decide for a deterministic transition system whether a Petri net with an isomorphic reachability graph exists and in case to nd such a net (which must have the arc-labels of the transition system as transitions). In this paper, we weaken isomorphism to some form of bisimilarity that also takes concurrency into account and we consider safe nets that may have additiona...
متن کاملConcurrent Implementation of Asynchronous Transition Systems
The synthesis problem is to decide for a deterministic transition system whether a Petri net with an isomorphic reachability graph exists and in case to nd such a net which must have the arc labels of the transition system as transitions In this paper we weaken isomorphism to some form of bisimilarity that also takes concurrency into account and we consider safe nets that may have additional in...
متن کاملUnfolding Concurrent Well-Structured Transition Systems
Our main objective is to combine partial-order methods with verification techniques for infinite-state systems in order to obtain efficient verification algorithms for concurrent infinite-state systems. Partial-order methods are commonly used in the analysis of finite systems consisting of many parallel components. In this paper we propose an extension of these methods to parallel compositions ...
متن کاملHennessy-Milner Completeness in Transition Systems with Synchronous Concurrent Composition
We consider the problem of obtaining Hennessy-Milner soundness and completeness-the coincidence of logical equivalence and bisimilarity-in the setting of transition systems with synchronous concurrent composition. Starting from a richly expressive modal logic, motivated by resource semantics and distributed systems modelling, including both additive and multiplicative propositional connectives ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90050-9